- connected components
- взаимосвязанные элементы
The English-Russian dictionary on reliability and quality control. 2015.
The English-Russian dictionary on reliability and quality control. 2015.
Tarjan's strongly connected components algorithm — Tarjan s Algorithm (named for its discoverer, Robert Tarjan) is a graph theory algorithm for finding the strongly connected components of a graph. It can be seen as an improved version of Kosaraju s algorithm, and is comparable in efficiency to… … Wikipedia
Connected-component labeling — (alternatively connected component analysis, blob extraction, region labeling, blob discovery, or region extraction) is an algorithmic application of graph theory, where subsets of connected components are uniquely labeled based on a given… … Wikipedia
Connected Component Labeling — (alternatively connected component analysis) is an algorithmic application of graph theory, where subsets of connected components are uniquely labeled based on a given heuristic. Connected component labeling is not to be confused with… … Wikipedia
Connected component — Connected components are part of topology and graph theory, two related branches of mathematics. For the graph theoretic concept, see connected component (graph theory). In topology: connected component (topology). Implementations: Connected… … Wikipedia
Connected space — For other uses, see Connection (disambiguation). Connected and disconnected subspaces of R² The green space A at top is simply connected whereas the blue space B below is not connected … Wikipedia
Connected component (graph theory) — A graph with three connected components. In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example,… … Wikipedia
Connected category — In category theory, a branch of mathematics, a connected category is a category in which, for every two objects X and Y there is a finite sequence of objects with morphisms or for each 0 ≤ i < n (both directions are allowed in the same… … Wikipedia
Components of jet engines — Diagram of a typical gas turbine jet engine. Air is compressed by the fan blades as it enters the engine, and it is mixed and burned with fuel in the combustion section. The hot exhaust gases provide forward thrust and turn the turbines which… … Wikipedia
Connected Device Configuration — The Connected Device Configuration (CDC) is a specification of a framework for Java ME applications describing the basic set of libraries and virtual machine features that must be present in an implementation. The CDC is combined with one or more … Wikipedia
Locally connected space — In this topological space, V is a neighbourhood of p and it contains a connected neighbourhood (the dark green disk) that contains p. In topology and other branches of mathematics, a topological space X is locally connected if every point admits… … Wikipedia
Strongly connected component — Graph with strongly connected components marked A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex. In particular, this means paths in each direction; a path from a to b and also a … Wikipedia